package com.gorkr.test;

import org.junit.jupiter.api.Test;

/**
 * @author gorkr
 * @date 2022/06/18 11:51
 **/
public class TraverseDp {
    // 右下倾斜遍历二维数组


    public void rightDown(int[][] dp) {
        int n = dp.length;
        // l相当于 i j 的间距
        for (int l = 1; l < n - 1; l++) {
            for (int i = 0; i < n - l; i++) {
                int j = i + l;
                System.out.println("("+i+","+j+")");

            }
        }

    }
    @Test
    public void rightDownTest(){
        rightDown(new int[5][5]);

    }

}
    